A Memory Efficient Parallel Tridiagonal Solver
نویسندگان
چکیده
We present a memory efficient parallel algorithm for the solution of tridiagonal linear systems of equations that are diagonally dominant on a very large number of processors. Our algorithm can be viewed as a parallel partitioning algorithm. We illustrate its performance using some examples. Based on this partitioning algorithm, we introduce a recursive version that has logarithmic communication complexity.
منابع مشابه
A parallel solver for tridiagonal linear systems for distributed memory parallel computers
Brugnano, L_, A parallel solver for tridiagonal linear systems for distributed memory parallel computers, Parallel Computing 17 (1991) 1017-1023. The solution of linear tridiagonal systems is a very common problem in Numerical Analysis. Many algorithms are known for solving such linear systems on vector and parallel computers [3,4,6-9]. In this paper a new parallel method is presented, which is...
متن کاملMathematical Modeling and Analysis An Efficient, Numerically Stable, and Scalable Parallel Tridiagonal Solver
We describe a stable, efficient, parallel algorithm for the solution of diagonally dominant tridiagonal linear systems that scales well on distributed memory parallel computers. This algorithm is in the class of partitioning algorithms. Its multi-level recursive design makes it well suited for distributed memory parallel computers with very large numbers of processors. The need to solve large t...
متن کاملEfficient heterogeneous execution on large multicore and accelerator platforms: Case study using a block tridiagonal solver
The algorithmic and implementation principles are explored in gainfully exploiting GPU accelerators in conjunction with multicore processors on high-end systems with large numbers of compute nodes, and evaluated in an implementation of a scalable block tridiagonal solver. The accelerator of each compute node is exploited in combination with multicore processors of that node in performing block-...
متن کاملEfficient Parallel Algorithm for Direct Numerical Simulation of Turbulent Flows
A distributed algorithm for a high-order-accurate finite-difference approach to the direct numerical simulation (DNS) of transition and turbulence in compressible flows is described. This work has two major objectives. The first objective is to demonstrate that parallel and distributed-memory machines can be successfully and efficiently used to solve computationally intensive and input/output i...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کامل